Schur Complement based domain decomposition preconditioners with Low-rank corrections
نویسندگان
چکیده
This paper introduces a robust preconditioner for general sparse symmetric matrices, that is based on low-rank approximations of the Schur complement in a Domain Decomposition (DD) framework. In this “Schur Low Rank” (SLR) preconditioning approach, the coefficient matrix is first decoupled by DD, and then a low-rank correction is exploited to compute an approximate inverse of the Schur complement associated with the interface points. The method avoids explicit formation of the Schur complement matrix. We show the feasibility of this strategy for a model problem, and conduct a detailed spectral analysis for the relationship between the low-rank correction and the quality of the preconditioning. Numerical experiments on general matrices illustrate the robustness and efficiency of the proposed approach.
منابع مشابه
A Spatial Domain Decomposition Method for Parabolic Optimal Control Problems ?
We present a non-overlapping spatial domain decomposition method for the solution of linear–quadratic parabolic optimal control problems. The spatial domain is decomposed into non-overlapping subdomains. The original parabolic optimal control problem is decomposed into smaller problems posed on space-time cylinder subdomains with auxiliary state and adjoint variables imposed as Dirichlet bounda...
متن کاملNeumann-Neumann Domain Decomposition Preconditioners for Linear-Quadratic Elliptic Optimal Control Problems
We present a class of domain decomposition (DD) preconditioners for the solution of elliptic linear-quadratic optimal control problems. Our DD preconditioners are extensions of Neumann–Neumann DD preconditioners, which have been successfully applied to the solution of single PDEs. The DD preconditioners are based on a decomposition of the optimality conditions for the elliptic linear-quadratic ...
متن کاملBlock Diagonal Preconditioners for the Schur Complement Method Block Diagonal Preconditioners for the Schur Complement Method
We present numerical methods for solving systems of linear equations originated from the discretisation of two-dimensional elliptic partial diierential equations. We are interested in diierential equations that describe heterogeneous and anisotropic phenomena. We use a nonoverlapping domain decomposition method for solving the linear systems. We describe new local preconditioners for the interf...
متن کامل1 Schur complement preconditioners for distributed general sparse linear systems ?
This paper discusses the Schur complement viewpoint when developing parallel preconditioners for general sparse linear systems. Schur complement methods are pervasive in numerical linear algebra where they represent a canonical way of implementing divide-and-conquer principles. The goal of this note is to give a brief overview of recent progress made in using these techniques for solving genera...
متن کاملUpdating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
This work focuses on the iterative solution of sequences of KKT linear systems arising in interior point methods applied to large convex quadratic programming problems. This task is the computational core of the interior point procedure and an efficient preconditioning strategy is crucial for the efficiency of the overall method. Constraint preconditioners are very effective in this context; ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016